Lightening Global Types

Global session types prevent participants from waiting for never coming messages. Some interactions take place just for the purpose of informing receivers that some message will never arrive or the session is terminated. By decomposing a big global type into several light global types, one can avoid such kind of redundant interactions. Lightening global types gives us cleaner global types, which keep all necessary communications. This work proposes a framework which allows to easily decompose global types into light global types, preserving the interaction sequences of the original ones but for redundant interactions.Comment: In Proceedings PLACES 2014, arXiv:1406.331

Optimal managerial decision model in a closed-loop supply chain for a retailer to collect used products with different transfer policy

In recent years, the concerns of environmental and resource issues are growing. Due to a great deal of attention for closed-loop supply chains, collection behaviour of used products from public consumers becomes more and more important. This paper proposes an inventory model for retailer with new products and used products and the retailer is the decision maker who follows the rule of Economic Ordering Quantity (EOQ) model. We assumed that the retailer not only sells products but also collects those sold used products. The proposed problem faced by the retailer is formulated as a cost-minimization problem where the replenishment quantity of new products and the return rate of used products are the decision variables and an efficient iterative algorithm is provided to search for the solution. Furthermore, we extend our model to consider the "not lot for lot policy" inventory model for forward channel and reverse channel and determine the optimal management policy. Finally, we discuss the economical decision modelling for a retailer to analyse the willingness of collecting used products

Mixin Composition Synthesis based on Intersection Types

We present a method for synthesizing compositions of mixins using type inhabitation in intersection types. First, recursively defined classes and mixins, which are functions over classes, are expressed as terms in a lambda calculus with records. Intersection types with records and record-merge are used to assign meaningful types to these terms without resorting to recursive types. Second, typed terms are translated to a repository of typed combinators. We show a relation between record types with record-merge and intersection types with constructors. This relation is used to prove soundness and partial completeness of the translation with respect to mixin composition synthesis. Furthermore, we demonstrate how a translated repository and goal type can be used as input to an existing framework for composition synthesis in bounded combinatory logic via type inhabitation. The computed result is a class typed by the goal type and generated by a mixin composition applied to an existing class

Mixin Composition Synthesis Based on Intersection Types

We present a method for synthesizing compositions of mixins using type inhabitation in intersection types. First, recursively defined classes and mixins, which are functions over classes, are expressed as terms in a lambda calculus with records. Intersection types with records and record-merge are used to assign meaningful types to these terms without resorting to recursive types. Second, typed terms are translated to a repository of typed combinators. We show a relation between record types with record-merge and intersection types with constructors. This relation is used to prove soundness and partial completeness of the translation with respect to mixin composition synthesis. Furthermore, we demonstrate how a translated repository and goal type can be used as input to an existing framework for composition synthesis in bounded combinatory logic via type inhabitation. The computed result corresponds to a mixin composition typed by the goal type

SAGITTAL AND FRONTAL LOWER LIMBS KINETICS DURING STEPPING DOWN IN TAICHI ELDERLY

The aim was to compare the kinetic characteristics of the beginning stance phase during stepping down in Taichi and normal elderly. Nine elderly taichi subjects and eleven matched controls participated in the study. Whole body kinematics and ground reaction forces (GRF) were recorded using 10 Vicon cameras (250Hz) and two Kistler force plates (1000Hz). Sagittal and frontal kinetic parameters were calculated by using Visual3D software. Differences in variables between groups were tested using t-test. The results indicated hip extensor / knee flexor / ankle plantarflexor / support moment and peak hip/knee/ankle power were greater in Taichi group. It was concluded that Taichi group has ability to translate forward movement (hip moment / power), to control body (knee moment /power) and to absorption energy (ankle moment / power) in sagittal plane

Centella asiatica extract protects against amyloid β1–40-induced neurotoxicity in neuronal cells by activating the antioxidative defence system

AbstractCentella asiatica (雷公根 léi gōng gēn) is a traditional medicinal herb with high antioxidant activity, which decreases amyloid-β (Aβ) deposition in the brain. At the same time, aggregated Aβ-induced oxidative stress is the trigger in the pathogenesis of Alzheimer's disease (AD). Here, we investigated the ability of C. asiatica ethanol extract (CAE) to protect PC12 and IMR32 cells from Aβ1–40-induced production of reactive oxygen species (ROS) and concomitant neurotoxicity. Aggregated Aβ1–40 treatment resulted in reduced cell viability, which can be reversed by cotreatment with 25, 50, and 100 μg/mL CAE. Moreover, CAE eliminated the Aβ1–40-mediated increase in ROS production. Thus, CAE-mediated protection against aggregated Aβ1–40-induced neurotoxicity is attributable to modulation of the antioxidative defense system in cells, including the activities of superoxide dismutase, catalase, glutathione peroxidase, glutathione reductase, and levels of glutathione and glutathione disulfide by CAE. This emphasizes the potential therapeutic and preventive value of CAE in the treatment of AD

On the preciseness of subtyping in session types

Subtyping in concurrency has been extensively studied since early 1990s as one of the most interesting issues in type theory. The correctness of subtyping relations has been usually provided as the soundness for type safety. The converse direction, the completeness, has been largely ignored in spite of its usefulness to define the largest subtyping relation ensuring type safety. This paper formalises preciseness (i.e. both soundness and completeness) of subtyping for mobile processes and studies it for the synchronous and the asynchronous session calculi. We first prove that the well-known session subtyping, the branching-selection subtyping, is sound and complete for the synchronous calculus. Next we show that in the asynchronous calculus, this subtyping is incomplete for type-safety: that is, there exist session types T and S such that T can safely be considered as a subtype of S, but T ≤ S is not derivable by the subtyping. We then propose an asynchronous subtyping system which is sound and complete for the asynchronous calculus. The method gives a general guidance to design rigorous channel-based subtypings respecting desired safety properties. Both the synchronous and the asynchronous calculus are first considered with linear channels only, and then they are extended with session initialisations and communications of expressions (including shared channels)